Fast image search on a VQ compressed image database
نویسنده
چکیده
A fast and efficient image search method is developed for a compressed image database using vector quantization (VQ). An image search on an image database requires an exhaustive sequential scan of all the images, given the similarity measure. If compressed images are dealt with, images are decompressed as an initial operation and then the previously mentioned exhaustive search is performed using the predetermined similarity measure. If the images in the database are compressed using VQ, the image search process is reduced to codebook index match tests. A pixel by pixel similarity test of two images computationally costs too much. This bottleneck is overcome by using VQ, where the similarity test of the two image block is performed by a precalculated distortion lookup table. The same is valid for the object search in the image database. The object image is vector quantized first; then the index map of the object image is scanned over the entire index area of the compressed image database. Significant image search speed gains on the VQ image database are obtained. Results show that the VQ compressed image search is faster than a sequential search, and compressed and decompressed JPEG search. Actual speed gain obtained here depends on the application area and required image quality for the database.
منابع مشابه
Semantic-Based Image Retrial in the VQ Compressed Domain using Image Annotation Statistical Models
متن کامل
Spatio-temporal indexing of vector quantized video sequences
Visual (image and video) database systems require efficient indexing to enable fast access to the images in a database. In addition, the large memory capacity and channel bandwidth requirements for the storage and transmission of visual data necessitate the use of compression techniques. Vector quantization (VQ) is an efficient technique for low bit-rate image and video compression. In addition...
متن کاملContent-Based Image Retrieval Via Vector Quantization
Image retrieval and image compression are each areas that have received considerable attention in the past. In this work, we present an approach for content-based image retrieval (CBIR) using vector quantization (VQ). Using VQ allows us to retain the image database in compressed form without any need to store additional features for image retrieval. The hope is that encoding an image with a cod...
متن کاملMedical Image Indexing and Compression Based on Vector Quantization: Image Retrieval Efficiency Evaluation
This paper addresses the problem of efficient image retrieval from a compressed image database, using information derived from the compression process. Images in the database are compressed applying two approaches: Vector Quantization (VQ) and Quadtree image decomposition. Both are based on Konohen’s Self-Organizing Feature Maps (SOFM) for creating vector quantization codebooks. However, while ...
متن کاملImage Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix
In this article, a fabulous method for database retrieval is proposed. The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...
متن کامل